Lex M versus MCS-M
نویسنده
چکیده
We study the problem of minimal triangulation of graphs. One of the first algorithms to solve this problem was Lex M, which was presented in 1976. A new algorithm, and a simplification of Lex M called MCS-M, was presented in 2002. In this paper we compare these two algorithms and show that they produce the same set of triangulations, answering an open question mentioned by the authors of MCS-M.
منابع مشابه
Reports in Informatics Issn 0333-3590 Lex M versus Mcs-m Lex M versus Mcs-m
We study the problem of minimal triangulation of graphs. One of the first algorithms to solve this problem is Lex M, which was presented in 1976. A new algorithm, and a simplification of Lex M, called MCS-M was presented in 2002. In this paper we compare these two algorithms and show that they produce the same set of chordal graphs, answering an open question mentioned by the authors of MCS-M.
متن کاملMaximum Cardinality Search for Computing Minimal Triangulations
We present a new algorithm, called MCS-M, for computing minimal triangulations of graphs. Lex-BFS, a seminal algorithm for recognizing chordal graphs, was the genesis for two other classical algorithms: Lex-M and MCS. Lex-M extends the fundamental concept used in Lex-BFS, resulting in an algorithm that also computes a minimal triangulation of an arbitrary graph. MCS simplified the fundamental c...
متن کاملAn inflammatory checkpoint regulates recruitment of graft-versus-host reactive T cells to peripheral tissues
Transfer of T cells to freshly irradiated allogeneic recipients leads to their rapid recruitment to nonlymphoid tissues, where they induce graft-versus-host disease (GVHD). In contrast, when donor T cells are transferred to established mixed chimeras (MCs), GVHD is not induced despite a robust graft-versus-host (GVH) reaction that eliminates normal and malignant host hematopoietic cells. We dem...
متن کاملProbabilistic analysis of stability of chain pillars in Tabas coal mine in Iran using Monte Carlo simulation
Performing a probabilistic study rather than a determinist one is a relatively easy way to quantify the uncertainty in an engineering design. Due to the complexity and poor accuracy of the statistical moment methods, the Monte Carlo simulation (MCS) method is wildly used in an engineering design. In this work, an MCS-based reliability analysis was carried out for the stability of the chain pill...
متن کاملAN ADAPTIVE IMPORTANCE SAMPLING-BASED ALGORITHM USING THE FIRST-ORDER METHOD FOR STRUCTURAL RELIABILITY
Monte Carlo simulation (MCS) is a useful tool for computation of probability of failure in reliability analysis. However, the large number of samples, often required for acceptable accuracy, makes it time-consuming. Importance sampling is a method on the basis of MCS which has been proposed to reduce the computational time of MCS. In this paper, a new adaptive importance sampling-based algorith...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 306 شماره
صفحات -
تاریخ انتشار 2006